An algebraic theory of order
نویسندگان
چکیده
منابع مشابه
An algebraic theory of order
In this paper, we present an abstract framework which describes algebraically the derivation of order conditions independently of the nature of differential equations considered or the type of integrators used to solve them. Our structure includes a Hopf algebra of functions, whose properties are used to answer several questions of prime interest in numerical analysis. In particular, we show th...
متن کاملAn Algebraic Theory
We give an algebraic formalization of SLD-trees and their abstractions (ob-servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملAn Algebraic Schwarz Theory
SCHWARZ THEORY 27 Algorithm 4.1 (Abstract Multiplicative Schwarz Method { Implementation Form) un+1 = MS(un; f) where the operation uNEW = MS(uOLD; f) is de ned as: Do k = 1; : : : ; J rk = IT k (f AuOLD) ek = Rkrk uNEW = uOLD + Ikek uOLD = uNEW End do. Note that the rst step through the loop in MS( ; ) gives: uNEW = uOLD + I1e1 = uOLD + I1R1IT 1 (f AuOLD) = (I I1R1IT 1 A)uOLD + I1R1IT 1 f: Con...
متن کاملAn Algebraic Theory of Observables
We give an algebraic formalization of SLD-trees and their abstractions (ob servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملNewton Polygons of Higher Order in Algebraic Number Theory
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a p-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by Ø. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2009
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an/2009029